\section{System testing}
\subsection{A1 and A2}
We have ran test case taskgraph\_1.graphml that is schedulable and taskgraph\_2.graphml and taskgraph\_4.graphml that are not schedulable.

\begin{figure*}
  \centering 
  \includegraphics[scale=0.6]{resources/simulation-1.png}
  \caption{Schedule of taskgraph\_1.graphml computed by the \textit{Simulator}}\label{img-sched1}
\end{figure*}


%\newpage
%
%
%\begin{figure*}[h!t!p!]
%  \centering 
%  \includegraphics[scale=0.4]{resources/simulation-2.png}
%  \caption{Schedule of taskgraph\_2.graphml computed by the \textit{Simulator}}\label{img-sched2}
%\end{figure*}

\begin{table}
\caption{Worst case response time for taskgraph\_1 computed using response-time analysis and Very Simple Simulator:}
\begin{tabular}{r c c}
task &  RTA & VSS \\  
\hline
T1 &	1.0 &	0 \\
T3 &	2.0 &	1 \\
T4 &	4.0 &	2 \\
T5 &	6.0 &	3 \\
T6 &	10.0 &	5 \\
T7 &	28.0 &	8 \\
T2 &	54.0 &	14 \\
\end{tabular}
\label{table1}
\end{table}

\begin{table}
\caption{Worst case response time for taskgraph\_2 computed using response-time analysis and Very Simple Simulator:}
\begin{tabular}{r c c}
task &  RTA & VSS \\  
 \hline
T1 &	1.0 &	0 \\
T2 &	3.0 &	1 \\
T3 &	6.0 &	3 \\
T4 &	10.0 &	5 \\
T5 &	15.0 &	9 \\
T6 &	23.0 &	12 \\
T7 &	37.0 &	18 \\
T8 &	49.0 &	28 \\
T9 &	98.0 &	34 \\
T10 &	-1.0 &	39 \\
T11 &	-1.0 &	57
\end{tabular}
\label{table2}
\end{table}


\begin{table}
\caption{Worst case response time for taskgraph\_4 computed using response-time analysis and Very Simple Simulator:}
\begin{tabular}{r c c}
task &  RTA & VSS \\  
 \hline
T1 &	4.0 &	2 \\
T3 &	-1.0 &	27 \\
T4 &	-1.0 &	0 \\
T5 &	-1.0 &	0 \\
T6 &	-1.0 &	0 \\
T7 &	-1.0 &	0 \\
T2 &	-1.0 &	0 \\
\end{tabular}
\label{table4}
\end{table}

%\newpage
%
%\begin{figure*}[h!t!p!]
%  \centering 
%  \includegraphics[scale=0.6]{resources/simulation-4.png}
%  \caption{Schedule of taskgraph\_4.graphml computed by the \textit{Simulator}. The white line is the delimiter between the job from a previous period and the job from the current period}\label{img-sched4}
%\end{figure*}

% 
% \begin{verbatim}
% schedulable according to RTA:true
% \end{verbatim}



% \begin{verbatim}
% schedulable according to RTA:false
% \end{verbatim}

%Comparing the worst case response times computed by the \textit{Response-Time Analysis} shown below, with the response times from the schedule computed by the 
%\textit{Simulator}, shown in figure \ref{img-sched2} it can be seen, that the worst case response time is the same for task set 1 and 3-6, whereas the scheduled task set 2 has a worst case response time at 7 timeunits more than the computed one, and the scheduled task set 7 has a worst case response time at 2 more than the one computed by the \textit{ResponseTimeAnalyser}



% \begin{verbatim}
% schedulable according to RTA:false
% \end{verbatim}
% 

%The schedule computed by the \textit{Simulator} can be seen in \ref{img-sched2}.

From table \ref{table1} it can be seen that taskgraph\_1 and is schedulable according to the \textit{ResponseTimeAnalyzer}. It can also be seen in the schedule computed by the \textit{Simulator} figure \ref{img-sched1}, since no deadlines are missed.

From tables \ref{table2} and \ref{table4} it can be seen that taskgraph\_2 and taskgraph\_4 respectively are not schedulable according to the \textit{ResponseTimeAnalyzer}.

\subsection{A3}
In this subsection we will briefly discuss the testing of our task scheduler, more precisely we will introduce the task graph which we have used for testing and provide the results which we got when testing our ASAP algorithm implementation. The rest of the testing will be discussed in \textit{Analysis} section.

Our task graph (see Figure \ref{img-task-graph}) consists of 16 tasks. The task computation and communication costs are represented on the graph nodes and branched respectively. It is worth mentioning that tasks 11-16 are identical.
\begin{figure*}
  \centering 
  \includegraphics[scale=0.8]{resources/task-graph.png}
  \caption{Input task graph}\label{img-task-graph}
\end{figure*}

Before applying scheduling described in \textit{Technical solution} section it is a requirement to sort tasks. As it was mentioned earlier we have chosen ASAP priority assignment algorithm. As a part of the testing this algorithm was applied on our test graph. The results can be found in Table \ref{table-asap}. As expected tasks 11-16 were assigned the same priority value by ASAP algorithm.
\begin{table}
\caption{Values assigned to each node of the task graph by ASAP algorithm}
\begin{tabular}{r c c}
task &  ASAP values\\  
\hline
0 &		0\\
1 &		8\\
2 &		4\\
3 &		5\\
4 &		6\\
5 &		16\\
6 &		10\\
7 &		14\\
8 &		13\\
9 &		23\\
10 &	27\\
11 &	34\\
12 &	34\\
13 &	34\\
14 &	34\\
15 &	34\\
16 &	34\\
\end{tabular}
\label{table-asap}
\end{table}

The testing of our scheduling algorithm and task duplication will be discussed in the \textit{Analysis} section.
